Another stable group

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Another Stable Group Heisenberg-stipendiat Der Deutschen Forschungsgemeinschaft

In [3] an uncountably categorical group is constructed that has a non-locallymodular geometry and does not allow the interpretation of a eld. We consider a system of elementary axioms ful lled by some special subgroups of the group above. We show that is complete, stable, but not superstable. It is even not a R-group in the sense of [10].

متن کامل

Stable group scheduling

We consider the situation in which an organizer is trying to convene an event, and needs to decide on a schedule: a time slot and a set of invitees from a given set of agents. For each possible time slot, each agent has a single-peaked preference over the number of attendees at the event. Agent also has the outside option of not attending, which she prefers in some situations. The task of the o...

متن کامل

Stable Group Purchasing Organizations

In this paper, we study the stability of Group Purchasing Organizations (GPOs). GPOs exist in several sectors and benefit its members through quantity discounts and negotiation power when dealing with suppliers. However, despite several obvious benefits, GPOs suffer from member dissatisfaction due to unfair allocations of the accrued savings among its members. We first explore the benefits of a...

متن کامل

Another Monte Carlo Renormalization Group Algorithm

A Monte Carlo Renormalization Group algorithm is used on the Ising model to derive critical exponents and the critical temperature. The algorithm is based on a minimum relative entropy iteration developed previously to derive potentials from equilibrium configurations. This previous algorithm is modified to derive useful information in an RG iteration. The method is applied in several dimension...

متن کامل

Another Look at Stable Forking in 1-based Supersimple Theories

We give two alternative proofs that 1-based theories of finite SU-rank have stable forking, neither of which seems to require the full power of elimination of hyperimaginaries. We also show some miscellaneous results related to stable forking in simple theories.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1996

ISSN: 0168-0072

DOI: 10.1016/0168-0072(95)00059-3